A controlled random search procedure for global optimisation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Search Algorithm for Global Optimisation

This paper investigates a global search optimisation technique, referred to as the repeated weighted boosting search. The proposed optimisation algorithm is extremely simple and easy to implement. Heuristic explanation is given for the global search capability of this technique. Comparison is made with the two better known and widely used global search techniques, known as the genetic algorithm...

متن کامل

Global Search Strategies for Simulation Optimisation

Simulation optimization is rapidly becoming a mainstream tool for simulation practitioners, as several simulation packages include add-on optimization tools. In this paper we are concentrating on an automated optimization approach that is based on adapting model parameters in order to handle uncertainty that arises from stochastic elements of the process under study. We particularly investigate...

متن کامل

PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION

Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...

متن کامل

Improved Cuckoo Search Algorithm for Global Optimization

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

متن کامل

A random search and backtracking procedure for transfer line balancing

The optimal logical layout design for a type of machining transfer lines is addressed. Such transfer lines are made of many machine-tools (workstations) located in sequence. On each workstation there are several spindle-heads. A spindle-head does not execute a single operation but a block of machining operations simultaneously. Spindle-heads of the same workstation are activated sequentially in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1977

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/20.4.367